On The Usual Fibonacci and Generalized Order-k Pell Numbers
نویسنده
چکیده
In this paper, we give some relations involving the usual Fibonacci and generalized order-k Pell numbers. These relations show that the generalized order-k Pell numbers can be expressed as the summation of the usual Fibonacci numbers. We nd families of Hessenberg matrices such that the permanents of these matrices are the usual Fibonacci numbers, F2i 1; and their sums. Also extending these matrix representations, we nd families of super-diagonal matrices such that the permanents of these matrices are the generalized order-k Pell numbers and their sums. 1. Introduction The well-known Fibonacci sequence fFng is de ned by the following recursive relation, for n > 2; Fn = Fn 1 + Fn 2: with initial conditions F1 = F2 = 1: The Pell sequence fPng is de ned recursively by the equation, for n > 2 Pn = 2Pn 1 + Pn 2 (1.1) where P1 = 1; P2 = 2: In [5], Ercolano gave the matrix method for generating the Pell sequence as follows: M = Pn+1 Pn Pn Pn 1 (1.2) The permanent of an n-square matrix A = (aij) is de ned by
منابع مشابه
The generalized order-k Fibonacci–Pell sequence by matrix methods
In this paper, we consider the usual and generalized order-k Fibonacci and Pell recurrences, thenwe define a new recurrence, which we call generalized order-k F–P sequence. Also we present a systematic investigation of the generalized order-k F–P sequence. We give the generalized Binet formula, some identities and an explicit formula for sums of the generalized order-k F–P sequence by matrix me...
متن کاملMore on the innite sum of reciprocal usual Fibonacci, Pell and higher order recurrences
Recently some authors [Z. Wenpeng and W. Tingting, Appl. Math. Comput. 218 (10) (2012), 61646167; T. Komatsu and V. Laohakosol, J. Integer Seq. 13 (5) (2010), Article 10.5.8.] computed partial in nite sums including reciprocal usual Fibonacci, Pell and generalized order-k Fibonacci numbers. In this paper we will present generalizations of earlier results by considering more generalized higher ...
متن کاملFormulas For Sums Of Generalized Order-k Fibonacci Type Sequences By Matrix Methods
In this paper, we give formulas for the sums of generalized order-k Fibonacci, Pell and similar other sequences which we obtain using matrix methods. As applications, we give explicit formulas for the Tribonacci and Tetranacci numbers. 1. Introduction The well-known Fibonacci sequence fFng is de ned for n > 2 by Fn+1 = Fn + Fn 1 where F1 = F2 = 1: The well-known Pell sequence fPng is de ned for...
متن کاملOn Families Of Bipartite Graphs Associated With Sums Of Generalized Order-k Fibonacci And Lucas Numbers
In this paper, we consider the relationships between the sums of the generalized order-k Fibonacci and Lucas numbers and 1-factors of bipartite graphs. 1. Introduction We consider the generalized order k Fibonacci and Lucas numbers. In [1], Er de ned k sequences of the generalized order k Fibonacci numbers as shown: g n = k X j=1 g n j ; for n > 0 and 1 i k; (1.1) with boundary conditions for 1...
متن کاملOn The Second Order Linear Recurrences By Generalized Doubly Stochastic Matrices
In this paper, we consider the relationships between the second order linear recurrences, and the generalized doubly stochastic permanents and determinants. 1. Introduction The Fibonacci sequence, fFng ; is de ned by the recurrence relation, for n 1 Fn+1 = Fn + Fn 1 (1.1) where F0 = 0; F1 = 1: The Lucas Sequence, fLng ; is de ned by the recurrence relation, for n 1 Ln+1 = Ln + Ln 1 (1.2) where ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ars Comb.
دوره 88 شماره
صفحات -
تاریخ انتشار 2008